Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation
نویسندگان
چکیده
Stochastic process algebras have been introduced in order to enable compositional performance analysis. The size of the state space is a limiting factor, especially if the system consists of many cooperating components. To fight state space explosion, various proposals for compositional aggregation have been made. They rely on minimisation with respect to a congruence relation. This paper addresses the computational complexity of minimisation algorithms and explains how efficient, BDD-based data structures can be employed for this purpose.
منابع مشابه
BDD extensions for stochastic transition systems
A BDD (Binary Decision Diagram) is a compact canonical representation of a Boolean function. While BDDs are well-established in the area of functional system verification, their use for the purpose of performance analysis is a new idea. We use BDDs to represent labelled transition systems which arise from higher-level model specifications such as stochastic process algebras or structured stocha...
متن کاملFormal Characterisation of Immediate Actions in SPA with Nondeterministic Branching
Stochastic Process Algebras (SPA) are process algebras in which the duration of each activity is given by a random variable. If the stochastic aspect is restricted to Markovian, i.e. exponentially distributed durations, nice algebraic foundations are available. They include a formal semantics and an equational theory for Markovian bisimulation , a congruence that can be seen as a stochastic cou...
متن کاملSymbolic Minimisation of Stochastic Process Algebra Models
Stochastic process algebras have been introduced in order to enable compositional performance analysis. The size of the state space is a limiting factor, especially if the system consists of many cooperating components. To fight state space explosion, compositional aggregation based on congruence relations can be applied. This paper addresses the computational complexity of minimisation algorit...
متن کاملComputing Bisimulations for Stochastic Process Algebras using Symbolic Representations
Stochastic process algebras have been introduced in order to enable compositional performance analysis. The size of the state space is a limiting factor, especially if the system consists of many cooperating components. To fight state space explosion, various proposals for compositional aggregation have been made. They rely on minimisation with respect to a congruence relation. This paper addre...
متن کاملReview on Stochastic Comparison Relations
The report offers an overview of some stochastic simulation and bisimulation relations based on continuous-time Markov chains and on stochastic (possibly Markovian) process algebras.
متن کامل